On language classes accepted by stateless 5′ → 3′ Watson-Crick finite automata
نویسندگان
چکیده
منابع مشابه
Stateless multicounter 5′ → 3′ Watson-Crick automata
The model we consider are stateless counter machines which mix the features of one-head counter machines and special two-head Watson-Crick automata (WK-automata). These biologically motivated machines have reading heads that read the input starting from the two extremes. The reading process is finished when the heads meet. The machine is realtime or non-realtime depending on whether the heads a...
متن کاملHierarchy Results on Stateless Multicounter 5′ → 3′ Watson-Crick Automata
We consider stateless counter machines which mix the features of one-head counter machines and a special type of two-head Watson-Crick automata (WK-automata). Our biologically motivated machines have heads that read the input starting from the two extremes. The reading process is finished when there are no more symbols between the heads. Depending on whether the heads are required to advance at...
متن کامل5′→ 3′ Sensing Watson-Crick Finite Automata
DNA computers provide new paradigms of computing (Păun et al., 1998). They appeared at the end of the last century. In contrast, the theory of finite automata is well developed and intensively used in both theory and practice. The Watson-Crick automata, introduced in (Freund et al., 1997), relate to both fields. They are important in the field of (DNA) computing and have important relation to f...
متن کاملHierarchies of Stateless Multicounter 5′ → 3′ Watson-Crick Automata Languages
We consider stateless counter machines which mix the features of one-head counter machines and a special type of two-head Watson-Crick automata (WK-automata). Our Watson-Crick counter machines are biologically motivated. They have two heads that read the input starting from the two extremes. The reading process is finished when there are no more symbols between the heads, i.e., every letter of ...
متن کاملWatson-Crick Quantum Finite Automata
one-way quantum finite automata are reversible in nature, which greatly reduces its accepting property. In fact, the set of languages accepted by one-way quantum finite automata is a proper subset of regular languages. In this paper, we replace the tape head of one-way quantum finite automata with DNA double strand and name the model Watson-Crick quantum finite automata. The noninjective comple...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Az Eszterházy Károly Tanárképz? F?iskola tudományos közleményei
سال: 2023
ISSN: ['1216-6014', '1787-6117', '1787-5021', '1589-6498']
DOI: https://doi.org/10.33039/ami.2023.08.004